A linear time transform for probability aware planning
نویسندگان
چکیده
We present a transform that enables traditional Shortest-Feasible-Plan planners to reason about uncertain operators and produce plans which have higher probabilities of success. This transform converts a probability-aware domain description into a STRIPS-style description, where the probability of success is expressed by plan length. Using this transformed description a plan can be generated by a traditional planner. The transform is shown to be at worst linear in the size of the input, and allows the planning system to trade-oo accuracy against runtime as an anytime computation.
منابع مشابه
Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملA Comparison Between Fourier Transform Adomian Decomposition Method and Homotopy Perturbation ethod for Linear and Non-Linear Newell-Whitehead-Segel Equations
In this paper, a comparison among the hybrid of Fourier Transform and AdomianDecomposition Method (FTADM) and Homotopy Perturbation Method (HPM) is investigated.The linear and non-linear Newell-Whitehead-Segel (NWS) equations are solved and the results arecompared with the exact solution. The comparison reveals that for the same number of componentsof recursive sequences, the error of FTADM is ...
متن کاملGeneral Linear Chirplet Transform and Radar Target Classification
In this paper, we design an attractivealgorithm aiming to classify moving targets includinghuman, animal, vehicle and drone, at groundsurveillance radar systems. The non-stationary reflectedsignal of the targets is represented with a novelmathematical framework based on behavior of thesignal components in reality. We further propose usingthe generalized linear chirp transform for the analysisst...
متن کاملبررسی و تبیین مشکل ناسازگاری زمانی
In very, simple words, time inconsistency means failing to conduct programs in consistence with time. In other words, time inconsistency refers to a situation where economic decision-makers preferences transform a long time in a way that what they preferred at a certain time point is not consistent with their preferences at other time points. In everyday life, we always face time inconsistency....
متن کامل